On Seymour’s Decomposition Theorem
نویسنده
چکیده
Let M be a class of matroids closed under minors and isomorphism. Let M be a 3-connected matroid in M with an N-minor and let N have an exact k-separation (A, B). If there exists a k-separation (X ,Y ) of M such that A ⊆ X and B ⊆ Y , we say the k-separation (A, B) of N is induced in M. In this paper we give new sufficient conditions to determine if an exact k-separation of N is induced inM.
منابع مشابه
A Simple Algorithm for the Graph Minor Decomposition - Logic meets Structural Graph Theory
A key result of Robertson and Seymour’s graph minor theory is a structure theorem stating that all graphs excluding some fixed graph as a minor have a tree decomposition into pieces that are almost embeddable in a fixed surface. Most algorithmic applications of graph minor theory rely on an algorithmic version of this result. However, the known algorithms for computing such graph minor decompos...
متن کاملRegular matroid decomposition via signed graphs
The key to Seymour’s Regular Matroid Decomposition Theorem is his result that each 3-connected regular matroid with no R10or R12-minor is graphic or cographic. We present a proof of this in terms of signed graphs. 2004 Wiley Periodicals, Inc. J Graph Theory 48: 74–84, 2005
متن کاملAn Obstacle to a Decomposition Theorem for Near-Regular Matroids
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کاملM ay 2 00 9 An obstacle to a decomposition theorem for near - regular matroids ∗
Seymour’s Decomposition Theorem for regular matroids states that any matroid representable over both GF(2) and GF(3) can be obtained from matroids that are graphic, cographic, or isomorphic to R10 by 1-, 2-, and 3-sums. It is hoped that similar characterizations hold for other classes of matroids, notably for the class of near-regular matroids. Suppose that all near-regular matroids can be obta...
متن کاملA new proof of Seymour's 6-flow theorem
Tutte’s famous 5-flow conjecture asserts that every bridgeless graph has a nowhere-zero 5-flow. Seymour proved that every such graph has a nowhere-zero 6-flow. Here we give (two versions of) a new proof of Seymour’s Theorem. Both are roughly equal to Seymour’s in terms of complexity, but they offer an alternative perspective which we hope will be of value.
متن کامل